Towards Understanding Triangle Construction Problems

نویسندگان

  • Vesna Marinkovic
  • Predrag Janicic
چکیده

Straightedge and compass construction problems are one of the oldest and most challenging problems in elementary mathematics. The central challenge, for a human or for a computer program, in solving construction problems is a huge search space. In this paper we analyze one family of triangle construction problems, aiming at detecting a small core of the underlying geometry knowledge. The analysis leads to a small set of needed definitions, lemmas and primitive construction steps, and consequently, to a simple algorithm for automated solving of problems from this family. The same approach can be applied to other families of construction problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ArgoTriCS - automated triangle construction solver

In this paper a method for automatically solving a class of straightedge-and-compass construction problems is proposed. These are the problems where the goal is to construct a triangle given three located points. The method is based on identifying and systematizing geometric knowledge, a specific, restricted search and handling redundant or locus dependent instances. The proposed method is impl...

متن کامل

A TAXICAB VERSION OF A TRIANGLE' S APOLLONIUS CIRCLE

One of the most famous problems of classical geometry is the Apollonius' problem asks construction of a circle which is tangent to three given objects. These objects are usually taken as points, lines, and circles. This well known problem was posed by Apollonius of Perga ( about 262 - 190 B.C.) who was a Greek mathematician known as the great geometer of ancient times after Euclid and Archimede...

متن کامل

A simple construction of very high order non oscillatory compact schemes on unstructured meshes

In [3] have been constructed very high order residual distribution schemes for scalar problems. They were using triangle unstructured meshes. However, the construction was quite involved and was not very flexible. Here, following [1], we develop a systematic way of constructing very high order non oscillatory schemes for such meshes. Applications to scalar and systems problems are given.

متن کامل

Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication

Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is unknown. Three Boolean functions f1, f2 and f3 : F2 → {0, 1} are said to be triangle free if there is no x, y ∈ F2 such that f1(x) = f2(y) = f3(x + y) = 1. Th...

متن کامل

Low Discrepancy Constructions in the Triangle

Most quasi-Monte Carlo research focuses on sampling from the unit cube. Many problems, especially in computer graphics, are defined via quadrature over the unit triangle. Quasi-Monte Carlo methods for the triangle have been developed by Pillards and Cools (2005) and by Brandolini et al. (2013). This paper presents two QMC constructions in the triangle with a vanishing discrepancy. The first is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012